Througput Lower Bounds for Markovian Petri Nets: Transformation Techniques
نویسندگان
چکیده
This paper addresses the computation of lower bounds for the steady-state throughput of stochas-tic Petri nets with immediate and exponentially distributed service times of transitions. We try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing networks theories. Previous results for general service time distributions are improved for the case of Markovian nets by considering some pessimistic transformation rules operating locally on the net structure, its initial marking, and stochastic interpretation. Special interest have the obtained results for the case of live and bounded free choice nets and live marked graphs systems.
منابع مشابه
Througput Upper Bounds for Markovian Petri Nets: Embedded Subnets and Queueing Networks
This paper addresses the computation of upper bounds for the steady-state throughput of stochas-tic Petri nets with immediate and exponentially distributed service times of transitions. We try to deeply bridge stochastic Petri net theory to untimed Petri net and queueing network theories. Previous results for general service time distributions are improved for the case of Markovian nets by cons...
متن کاملHybrid Petri nets as an approximation to Markovian Petri nets ?
A Markovian Petri net is a stochastic discrete event system frequently used for analysis and performance evaluation purposes. In the past, the fluidification has been proposed as a relaxation technique for avoiding the ”state explosion problem”. Following the same approach, in this paper a hybrid Petri net model is defined as a partial relaxation of an original Markovian Petri net. It is shown ...
متن کاملSpeciications and Solution Techniques for Non-markovian Stochastic Petri Nets
Allmost all the available tools for the analysis of Stochastic Petri Nets (SPN) assume that the stochastic nature of the problem is restricted to be a Continuous Time Markov Chain (CTMC), but in reality, there are instances in which the CTMC assumption is too weak. The evolution of the stochastic systems with non-exponential timing becomes a stochastic process, for which in general, no analytic...
متن کاملSpeci cations and Solution Techniques for Non-Markovian Stochastic Petri Nets
Allmost all the available tools for the analysis of Stochastic Petri Nets (SPN) assume that the stochastic nature of the problem is restricted to be a Continuous Time Markov Chain (CTMC), but in reality, there are instances in which the CTMC assumption is too weak. The evolution of the stochastic systems with nonexponential timing becomes a stochastic process, for which in general, no analytica...
متن کاملStructural techniques and performance bounds of stochastic Petri net models
In this paper we overview some recent results obtained by the authors and collaborators on the performance bounds analysis of some stochastic Petri net systems. The mathematical model can be seen either as a result of the addition of a particular random timing interpretation to an \autonomous" Petri net or as a generalization of classical queueing networks with the addendum of a general synchro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991